Hartmanis, J. : rechercher sur Z-Library

Le plus grand référentiel d'articles scientifiques au monde. 70,000,000+ d'articles gratuitement.

Don't use scam websites

Livres
Articles (204)
Les plus populaires
Liste
- Liste
- Tableau

1

On the Computational Complexity of Algorithms

J. Hartmanis and R. E. Stearns

Journal:

Transactions of the American Mathematical Society

Année:

1965

Langue:

english

Fichier:

PDF, 1.72 MB

english, 1965

2

[IEEE 6th Annual Symposium on Switching Circuit Theory and Logical Design - Ann Arbor, MI, USA (1965.10.6-1965.10.8)] 6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965) - Hierarchies of memory limited computations

Stearns, R. E., Hartmanis, J., Lewis, P. M.

Année:

1965

Langue:

english

Fichier:

PDF, 387 KB

english, 1965

3

An Overview of the Theory of Computational Complexity

Hartmanis, J., Hopcroft, J. E.

Journal:

Journal of the ACM

Année:

1971

Langue:

english

Fichier:

PDF, 1.96 MB

english, 1971

4

Computers and Intractability: A Guide to the Theory of NP-Completeness.by Michael R. Garey; David S. Johnson

Review by: Juris Hartmanis

Journal:

Année:

1982

Langue:

english

Fichier:

PDF, 299 KB

english, 1982

5

Mathematical Notes

Hartmanis, J., Stearns, R. E., Mukhopadhyay, S. N., Chaudhuri, Jyoti, Johnson, H. H., Lebensold, Kenneth, Tucker, Joe, Keiser, V. H., Hardman, N. R., Jordan, J. H., Hirsch, Guy, Kripke, Bernard, Fulto

Journal:

American Mathematical Monthly

Année:

1967

Langue:

english

Fichier:

PDF, 1.70 MB

english, 1967

6

Computational complexity of random access stored program machines

Journal:

Theory of Computing Systems

Année:

1971

Langue:

english

Fichier:

PDF, 914 KB

english, 1971

7

[IEEE 6th Annual Symposium on Switching Circuit Theory and Logical Design - Ann Arbor, MI, USA (1965.10.6-1965.10.8)] 6th Annual Symposium on Switching Circuit Theory and Logical Design (SWCT 1965) - Memory bounds for recognition of context-free and context-sensitive languages

Lewis, P. M., Stearns, R. E., Hartmanis, J.

Année:

1965

Langue:

english

Fichier:

PDF, 426 KB

english, 1965

8

Turing Award lecture on computational complexity and the nature of computer science

Hartmanis, Juris

Journal:

Communications of the ACM

Année:

1994

Langue:

english

Fichier:

PDF, 1.05 MB

english, 1994

9

Genomic encoding of transcriptional burst kinetics

Larsson, Anton J. M., Johnsson, Per, Hagemann-Jensen, Michael, Hartmanis, Leonard, Faridani, Omid R., Reinius, Björn, Segerstolpe, Åsa, Rivera, Chloe M., Ren, Bing, Sandberg, Rickard

Journal:

Année:

2019

Langue:

english

Fichier:

PDF, 8.90 MB

english, 2019

10

Relations between diagonalization, proof systems, and complexity gaps

Juris Hartmanis

Journal:

Theoretical Computer Science

Année:

1979

Langue:

english

Fichier:

PDF, 1.55 MB

english, 1979

11

Tape-reversal bounded turing machine computations

Journal:

Journal of Computer and System Sciences

Année:

1968

Langue:

english

Fichier:

PDF, 667 KB

english, 1968

12

What makes some language theory problems undecidable

J. Hartmanis, J.E. Hopcroft

Journal:

Journal of Computer and System Sciences

Année:

1970

Langue:

english

Fichier:

PDF, 487 KB

english, 1970

13

A note on one-way and two-way automata

Journal:

Theory of Computing Systems

Année:

1970

Langue:

english

Fichier:

PDF, 279 KB

english, 1970

14

One-way functions and the nonisomorphism of NP-complete sets

Juris Hartmanis, Lane A. Hemachandra

Journal:

Theoretical Computer Science

Année:

1991

Langue:

english

Fichier:

PDF, 1.02 MB

english, 1991

15

[Lecture Notes in Computer Science] The World Wide Web and Databases Volume 1997 || Quilt: An XML Query Language for Heterogeneous Data Sources

Goos, Gerhard, Hartmanis, Juris, van Leeuwen, Jan, Suciu, Dan, Vossen, Gottfried

Année:

2001

Langue:

english

Fichier:

PDF, 99 KB

english, 2001

16

Logic, Computing Machines, and Automation.by Alice Mary Hilton

Review by: J. Hartmanis

Journal:

American Mathematical Monthly

Année:

1964

Langue:

english

Fichier:

PDF, 220 KB

english, 1964

17

The Cornell commission: on Morris and the worm

Eisenberg, T., Gries, D., Hartmanis, J., Holcomb, D., Lynn, M. S., Santoro, T.

Journal:

Communications of the ACM

Année:

1989

Langue:

english

Fichier:

PDF, 395 KB

english, 1989

18

Sets of Numbers Defined by Finite Automata

Journal:

American Mathematical Monthly

Année:

1967

Langue:

english

Fichier:

PDF, 394 KB

english, 1967

19

Problems for Solution: 4869-4874

M. S. Klamkin, D. S. Mitrinovitch, Juris Hartmanis, Ky Fan, W. R. Utz and D. J. Newman

Journal:

American Mathematical Monthly

Année:

1959

Langue:

english

Fichier:

PDF, 257 KB

english, 1959

20

A note on natural complete sets and Gödel numberings

Journal:

Theoretical Computer Science

Année:

1982

Langue:

english

Fichier:

PDF, 1.57 MB

english, 1982

21

Computation times of NP sets of different densities

J. Hartmanis, Y. Yesha

Journal:

Theoretical Computer Science

Année:

1984

Langue:

english

Fichier:

PDF, 1.48 MB

english, 1984

22

Complexity classes without machines: On complete languages for UP

Juris Hartmanis, Lane A. Hemachandra

Journal:

Theoretical Computer Science

Année:

1988

Langue:

english

Fichier:

PDF, 1012 KB

english, 1988

23

Robust machines accept easy sets

Juns Hartmanis, Lane A. Hemachandra

Journal:

Theoretical Computer Science

Année:

1990

Langue:

english

Fichier:

PDF, 1.03 MB

english, 1990

24

Space bounded computations: review and new separation results

Desh Ranjan, Richard Chang, Juris Hartmanis

Journal:

Theoretical Computer Science

Année:

1991

Langue:

english

Fichier:

PDF, 564 KB

english, 1991

25

The use of lists in the study of undecidable problemsin automata theory

J. Hartmanis, F.D. Lewis

Journal:

Journal of Computer and System Sciences

Année:

1971

Langue:

english

Fichier:

PDF, 496 KB

english, 1971

26

On non-determinancy in simple computing devices

Juris Hartmanis

Journal:

Acta Informatica

Année:

1972

Langue:

english

Fichier:

PDF, 511 KB

english, 1972

27

Two memory bounds for the recognition of primes by automata

J. Hartmanis, H. Shank

Journal:

Theory of Computing Systems

Année:

1969

Langue:

english

Fichier:

PDF, 304 KB

english, 1969

28

Computational complexity of formal translations

Journal:

Theory of Computing Systems

Année:

1974

Langue:

english

Fichier:

PDF, 801 KB

english, 1974

29

Automata-based computational complexity

J. Hartmanis, R.E. Stearns

Journal:

Information Sciences

Année:

1969

Langue:

english

Fichier:

PDF, 729 KB

english, 1969

30

New developments in structural complexity theory

Journal:

Theoretical Computer Science

Année:

1990

Langue:

english

Fichier:

PDF, 977 KB

english, 1990

31

On sparse sets in NP–P

Juris Hartmanis

Journal:

Information Processing Letters

Année:

1983

Langue:

english

Fichier:

PDF, 445 KB

english, 1983

32

Sparse sets in NP-P: EXPTIME versus NEXPTIME

J. Hartmanis, N. Immerman, V. Sewelson

Journal:

Information and Control

Année:

1985

Langue:

english

Fichier:

PDF, 1.10 MB

english, 1985

33

Innovation and Obstacles: the Future of Computing

Clark, D.D., Feigenbaum, E.A., Hartmanis, J., Lucky, R.W., Metcalfe, R.M., Reddy, R., Shaw, M.

Journal:

Année:

1998

Langue:

english

Fichier:

PDF, 983 KB

english, 1998

34

On Isomorphisms and Density of $NP$ and Other Complete Sets

Berman, L., Hartmanis, J.

Journal:

SIAM Journal on Computing

Année:

1977

Langue:

english

Fichier:

PDF, 1.87 MB

english, 1977

35

The Boolean Hierarchy I: Structural Properties

Cai, Jin-Yi, Gundermann, Thomas, Hartmanis, Juris, Hemachandra, Lane A., Sewelson, Vivian, Wagner, Klaus, Wechsung, Gerd

Journal:

SIAM Journal on Computing

Année:

1988

Langue:

english

Fichier:

PDF, 2.33 MB

english, 1988

36

On the Succinctness of Different Representations of Languages

Journal:

SIAM Journal on Computing

Année:

1980

Langue:

english

Fichier:

PDF, 866 KB

english, 1980

37

The Boolean Hierarchy II: Applications

Cai, Jin-Yi, Gundermann, Thomas, Hartmanis, Juris, Hemachandra, Lane A., Sewelson, Vivian, Wagner, Klaus, Wechsung, Gerd

Journal:

SIAM Journal on Computing

Année:

1989

Langue:

english

Fichier:

PDF, 1.95 MB

english, 1989

38

A comparison of the biological activity of the recombinant intact and truncated insulin-like growth factor 1 (IGF-1)

Christine Carlsson-Skwirut, Mats Lake, Maris Hartmanis, Kerstin Hall, Vicki R. Sara

Journal:

Biochimica et Biophysica Acta (BBA) - Molecular Cell Research

Année:

1989

Langue:

english

Fichier:

PDF, 636 KB

english, 1989

39

[Lecture Notes in Computer Science] Fast Software Encryption Volume 1978 || Securing the AES Finalists Against Power Analysis Attacks

Goos, Gerhard, Hartmanis, Juris, van Leeuwen, Jan, Schneier, Bruce

Année:

2001

Langue:

english

Fichier:

PDF, 251 KB

english, 2001

40

Observations About the Development of Theoretical Computer Science

Hartmanis, Juris

Journal:

IEEE Annals of the History of Computing

Année:

1981

Langue:

english

Fichier:

PDF, 12.32 MB

english, 1981

41

[Lecture Notes in Computer Science] The World Wide Web and Databases Volume 1997 || XML and Object-Relational Database Systems Enhancing Structural Mappings Based on Statistics

Goos, Gerhard, Hartmanis, Juris, van Leeuwen, Jan, Suciu, Dan, Vossen, Gottfried

Année:

2001

Langue:

english

Fichier:

PDF, 216 KB

english, 2001

42

Computational Complexity of One-Tape Turing Machine Computations

Journal:

Journal of the ACM

Année:

1968

Langue:

english

Fichier:

PDF, 779 KB

english, 1968

43

[Lecture Notes in Computer Science] Fast Software Encryption Volume 1978 || Efficient Methods for Generating MARS-Like S-Boxes

Goos, Gerhard, Hartmanis, Juris, van Leeuwen, Jan, Schneier, Bruce

Année:

2001

Langue:

english

Fichier:

PDF, 113 KB

english, 2001

44

[IEEE 1964 Proceedings of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design - Princeton, NJ, USA (1964.11.11-1964.11.13)] 1964 Proceedings of the Fifth Annual Symposium on Switching Circuit Theory and Logical Design - Computational complexity of recursive sequnces

Hartmanis, J., Stearns, R. E.

Année:

1964

Langue:

english

Fichier:

PDF, 1.10 MB

english, 1964

45

On the Complexity of Undecidable Problems in Automata Theory

Journal:

Journal of the ACM

Année:

1969

Langue:

english

Fichier:

PDF, 481 KB

english, 1969

46

[IEEE 9th Annual Symposium on Switching and Automata Theory (swat 1968) - Schenedtady, NY, USA (1968.10.15-1968.10.18)] 9th Annual Symposium on Switching and Automata Theory (swat 1968) - Structure of undecidable problems in automata theory

Hartmanis, J., Hopcroft, J. E.

Année:

1968

Langue:

english

Fichier:

PDF, 837 KB

english, 1968

47

Independence results in computer science

Hartmanis, J., Hopcroft, J. E.

Journal:

ACM SIGACT News

Année:

1976

Langue:

english

Fichier:

PDF, 413 KB

english, 1976

48

[Lecture Notes in Computer Science] Algorithms and Computation Volume 1969 || Derandomizing Arthur-Merlin Games under Uniform Assumptions

Goos, Gerhard, Hartmanis, Juris, van Leeuwen, Jan, Lee, D. T., Teng, Shang-Hua

Année:

2000

Langue:

english

Fichier:

PDF, 158 KB

english, 2000

49

On the Recognition of Primes by Automata

Hartmanis, J., Shank, H.

Journal:

Journal of the ACM

Année:

1968

Langue:

english

Fichier:

PDF, 462 KB

english, 1968

50

[ACM Press the eighth annual ACM symposium - Hershey, Pennsylvania, United States (1976.05.03-1976.05.05)] Proceedings of the eighth annual ACM symposium on Theory of computing - STOC '76 - On isomorphisms and density of NP and other complete sets

Hartmanis, J., Berman, L.

Année:

1976

Langue:

english

Fichier:

PDF, 782 KB

english, 1976